Polynomial Running Times for Polynomial-Time Oracle Machines
نویسندگان
چکیده
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial functionals from computable analysis and second-order complexity theory are equated in a precise sense. The new notion is named ‘strong polynomial-time computability’, and proven to be a strictly stronger requirement than polynomial-time computability. It is proven that within the framework for complexity of operators from analysis introduced by Kawamura and Cook the classes of strongly polynomial-time computable functionals and polynomial-time computable functionals coincide. 1998 ACM Subject Classification F.1.1 Models of Computation, F.1.3 Complexity Measures and Classes
منابع مشابه
Type-two polynomial-time and restricted lookahead
This paper provides an alternate characterization of type-two polynomial-time computability, with the goal of making second-order complexity theory more approachable. We rely on the usual oracle machines to model programs with subroutine calls. In contrast to previous results, the use of higher-order objects as running times is avoided, either explicitly or implicitly. Instead, regular polynomi...
متن کاملApproximating Oracle
For every k, an oracle Turing machine M k , and rational polytopes P k (S) for all n and S f0; 1g n , are constructed; querying from the set S given as an oracle, M S k solves the separation problem over P k (S) in strongly polynomial time, performing O(n 3k) arithmetic operations. Each of the polytopes P k (S) approximates S in the sense P k (S) \ f0; 1g n = S and P k (S) 0; 1] n , and for all...
متن کاملTechnical Reports on Mathematical and Computing Sciences: TR-C168
For relativized arguments, we propose to restrict oracle queries to “stringent” ones; for comparing the power of two machine models relative to some oracle set, stringent relativization is to restrict machines of both types to ask queries on the same segment of the oracle. In particular, for investigating polynomial-time (or polynomial-size) computability, we propose polynomial stringency, boun...
متن کاملtitle : Relativized Collapsing Results under Stringent Oracle Access
For relativized arguments, we propose to restrict oracle queries to “stringent” ones. For example, when comparing the power of two machine models relative to some oracle set X, we restrict that machines of both types ask queries from the same segment of the set X. In particular, for investigating polynomial-time (or polynomial-size) computability, we propose polynomial stringency, bounding quer...
متن کاملThe Log Space Oracle Hierarchy Collapses DRAFT
The polynomial time hierarchy of Meyer and Stockmeyer has several equivalent characterizations — in particular it can be defined either in terms of polynomial time oracle Turing machines [Sto76], or in terms of polynomial time alternating Turing machines where the number of alternations is finitely bounded [CKS81]. One of the most important open questions in the area is whether or not this hier...
متن کامل